翻訳と辞書 Words near each other ・ Recurring Saturday Night Live characters and sketches introduced 2006–2007 ・ Recurring Saturday Night Live characters and sketches introduced 2007–2008 ・ Recurring Saturday Night Live characters and sketches introduced 2008–2009 ・ Recurring Saturday Night Live characters and sketches introduced 2009–2010 ・ Recurring Saturday Night Live characters and sketches introduced 2010–2011 ・ Recurring Saturday Night Live characters and sketches introduced 2011–2012 ・ Recurring Saturday Night Live characters and sketches introduced 2012–2013 ・ Recurring Saturday Night Live characters and sketches introduced 2013–2014 ・ Recurring segments on The Colbert Report ・ Recurring status ・ Recurse ・ Recursion ・ Recursion (computer science) ・ Recursion (disambiguation) ・ Recursion (novel) ・ Recursion termination ・ Recursion theorem ・ Recursive acronym ・ Recursive ascent parser ・ Recursive Bayesian estimation ・ Recursive categorical syntax ・ Recursive competitive equilibrium ・ Recursive data type ・ Recursive definition ・ Recursive descent parser ・ Recursive economics ・ Recursive filter ・ Recursive function ・ Recursive grammar ・ Recursive indexing Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Recursion termination ： ウィキペディア英語版 Recursion termination In computing, recursion termination is when certain conditions are met and a recursive algorithm stops calling itself and begins to return values.〔http://www.itl.nist.gov/div897/sqg/dads/HTML/recursiontrm.html〕 This happens only if, with every recursive call, the recursive algorithm changes its state and moves toward the base case. Cases that satisfy the definition, without being defined in terms of that definition, are called base cases. They are small enough to solve directly.〔 〕 ==Examples== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Recursion termination」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.